Efficient Classification-Based Relabeling in Mixture Models

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kernel-based Mixture Models for Classification

Kernels are now everywhere present in statistics as far as a dot product is at hand. However to the best of our knowledge kernels have not been used in mixture models. In the present work we show that they can be useful for classification purposes. They offer a flexibility in the modeling process through the kernel trick which enables capturing interesting features in some cases more easily tha...

متن کامل

Image Texture Classification Based on Finite Gaussian Mixture Models

A novel image texture classification method based on finite Gaussian mixture models of sub-band coefficients is proposed in this paper. In the method, an image texture is first decomposed into several sub-bands, then the marginal density distribution of coefficients in each sub-band is approximated by Gaussian mixtures. The Gaussian component parameters are estimated by an “EM+MML” algorithm wh...

متن کامل

A topic classification system based on parametric trajectory mixture models

In this paper we address the problem of topic classification of speech data. Our concern in this paper is the situation in which there is no speech or phoneme recognizer available for the domain of the speech data. In this situation the only inputs for training the system are audio speech files labeled according to the topics of interest. The process that we follow in developing the topic class...

متن کامل

Efficient MCMC sampling in dynamic mixture models

We show how to improve the efficiency of MCMC sampling in dynamic mixture models by block-sampling the discrete latent variable. Two algorithms are proposed: the first is a multi-move extension of the single-move Gibbs sampler devised by Gerlach, Carter and Kohn (2000); the second is an adaptive Metropolis-Hastings scheme that performs well even when the number of discrete states is large. Thre...

متن کامل

Learning Sparse Mixture Models for Discriminative Classification

Recently Saul and Lee proposed a mixture model for discriminative classification of non-negative data via non-negative matrix factorization for feature extraction. In order to improve the generalization, this paper considers a sparse version of the model. The basic idea is to minimize the sum of the weights of un-normalized mixture models for posterior distributions according to regularization ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The American Statistician

سال: 2011

ISSN: 0003-1305,1537-2731

DOI: 10.1198/tast.2011.10170